Algorithms for Determining Rationality of Parametric Affine Curves

نویسنده

  • Hyungju Park
چکیده

Let f1, . . . , fn ∈ k[t], where k is an arbitrary field. A necessary and sufficient condition for the two function fields k(t) and k(f1, . . . , fn) to be same is developed in terms of zero-dimensionality of an ideal in the bivariate polynomial ring k[s, t]. Since zero-dimensionality of such an ideal can be readily determined by a Gröbner basis computation, this gives an algorithm that determines if the curve C ⊂ Ank given parametrically by x1 = f1, . . . , xn = fn is rational. We also develop an algorithm that determines if k[t] and k[f1, . . . , fn] are same, by which we get an algorithm that determines if C is isomorphic to the affine line. 1991 Mathematics Subject Classification: 13P10

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Approximate parametrization of plane algebraic curves by linear systems of curves

It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance ǫ > 0 and an ǫ-irreducible algebraic affine plane curve C of proper degree d, we introduce the notion of ǫ-rationality, and we provide an algorithm to parametrize approximately affine ǫ-rational plane curves, without exact singularities at infinit...

متن کامل

Approximating Parametric Curves with Strip Trees using Affine Arithmetic

We show how to use affine arithmetic to represent a parametric curve with a strip tree. The required bounding rectangles for pieces of the curve are computed by exploiting the linear correlation information given by affine arithmetic. As an application, we show how to compute approximate distance fields for parametric curves.

متن کامل

A Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms

In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...

متن کامل

Automatic parameterization of rational curves and surfaces III: Algebraic plane curves

We consider algorithms to compute the genus and rational parametric equations, for implicitly defined irreducible rational plane algebraic curves of arbitrary degree. Rational panuneterizations exist for all irreducible algebraic curves of genus O. The genus is compuled by a complete analysis of the singularities of plane algebraic curves, using affine quadratic transformations. The rational pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998